Underspecified Interpretations in a Curry-typed Representation Language

Underspecified Interpretations in a Curry-typed Representation Language

In previous work we have developed Property Theory with Curry Typing ( ), an intensional first-order logic for natural language semantics. permits fine-grained specifications of meaning. It also supports polymorphic types and separation types.1 We develop an intensional number theory within in order to represent proportional generalized quantifiers like ‘most’, and we suggest a dynamic type-the...

Curry-Typed Semantics in Typed Predicate Logic

Various questions arise in semantic analysis concerning the nature of types. These questions include whether we need types in a semantic theory, and if so, whether some version of simple type theory (STT, Church, 1940) is adequate or whether a richer more flexible theory is required to capture our semantic intuitions. Propositions and propositional attitudes can be represented in an essentially...

First-Order, Curry-Typed Logic for Natural Language Semantics

The paper presents Property Theory with Curry Typing (PTCT) where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that ...

Toward a Universal Underspecified Semantic Representation

We define Canonical Form Minimal Recursion Semantics (CF-MRS) and prove that all the well-formed MRS structures generated by the MRS semantic composition algorithm are in this form. We prove that the qeq relationships are equivalent to outscoping relations when MRS structures are in this form. This result fills the gap between some underspecification formalisms and motivates defining a Canonica...

Direct and Underspecified Interpretations of LFG f-structures